A New String Matching Algorithm and its Application in Hand-Written Digits Recognition

نویسندگان

  • Mehrnoosh Bazrafkan
  • Ali Broumandnia
  • Sergios Theodoridis
  • Konstantinos Koutroumbas
  • H. Izakian
  • S. A. Monadjemi
  • B. Tork Ladani
  • K. Zamanifar
چکیده

In this paper a new algorithm is introduced for syntactic pattern recognition and string matching by using linked listdata structure which later could be used for hand written digits recognition. At first,handwritten digits are changed to string as input pattern by using chain-codethen the achieved string is recognized by using refer algorithm being implemented by linked list. This refer algorithm is able to compute the distance between the chain code strings shown in the implementation. The suggested algorithm reduces time complexity ofleven shtein's algorithm from second-order to linear-orderand in addition is able to decrease the consumption memory and increase accuracy of handwritten digits recognition as well. Our proposed implemented algorithm has 94. 8% accuracy over 3000 handwritten digits samples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Segmentation and Recognition of Hand-Written Digits Using OSSA Neural Network

This paper proposes a neural network approach to solve the hand-written digit recognition problem. The proposed approach is based on the graph matching, a form of elastic matching, and an one-variable stochastic simulated annealing(OSSA) algorithm which makes it possible to evaluate the spin average value effectively by Markov process in case of many real applications with continues variables. ...

متن کامل

A Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition

We present a neural network model based on graph matching and an annealing technique, one-variable stochastic simulated annealing(OSSA) which makes it possible to evaluate the spin average value effectively by Markov process in case of many real applications. In order to demonstrate the capability of our model we implemented a program that can segment and recognize hand-written digits. Input an...

متن کامل

Hand-Written Digits Recognition by Graph matching and Annealing Neural Networks

Mean field annealing(MFA) is a promising tool in optimization and a neural network model based on the graph matching have attracted attention due to a number of benefits over conventional recognition models. We present a neural network model for hand-written digits recognition using graph matching and two annealing techniques, MFA and one-variable stochastic simulated annealing(OSSA). OSSA make...

متن کامل

Parametric string matching and its application to pattern recognition

String matching is a useful concept in pattern recognition that is constantly receiving attention from both theoretical and practical points of view. In this paper we propose a generalized version of the string matching algorithm by Wagner and Fischer [1]. It is based on a parametrization of the edit cost. We assume constant cost for any delete and insert operation, but the cost for replacing a...

متن کامل

An Evolutionary Neural Network Architecture Optimization Algorithm for Hand Written Digits Recognition

Artificial Neural Network model is inspired by the functioning of the human brain. It is configured for a specific application, such as pattern recognition or data classification, through a learning process. In this paper we present a novel neural network architecture optimization algorithm from the given training pattern sets to solve a specific problem based on the principles of neuro-biology...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013